Efficient Substructure RMSD Query Algorithms

نویسندگان

چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Efficient Substructure RMSD Query Algorithms

Protein structure analysis is a very important research topic in the molecular biology of the post-genomic era. The root mean square deviation (RMSD) is the most frequently used measure for comparing two protein three-dimensional (3-D) structures. In this paper, we deal with two fundamental problems related to the RMSD. We first deal with a problem called the "range RMSD query" problem. Given a...

متن کامل

Efficient algorithms in quantum query complexity

In this thesis we provide new upper and lower bounds on the quantum query complexity of a diverse set of problems. Specifically, we study quantum algorithms for Hamiltonian simulation, matrix multiplication, oracle identification, and graph-property recognition. For the Hamiltonian simulation problem, we provide a quantum algorithm with query complexity sublogarithmic in the inverse error, an e...

متن کامل

Query Rewriting under EL TBoxes: Efficient Algorithms

We propose a new type of algorithm for computing firstorder (FO) rewritings of concept queries under EL-TBoxes that is tailored towards efficient implementation. The algorithm outputs a non-recursive datalog rewriting if the input is FO-rewritable and otherwise reports non-FO-rewritability. We carry out experiments with ontologies from practical applications which show that our algorithm perfor...

متن کامل

Rmsd Len Time Rmsd Len Time Rmsd Len Time

This paper proposes new algorithms for protein structure alignment. Protein structure alignment is, given two three-dimensional protein structures, to nd spatially equivalent residue pairs. Each algorithm consists of the following two steps: rst an initial superposition is computed; then a structure alignment is computed and re ned using bipartite graph matching. The proposed algorithms are sho...

متن کامل

Efficient Top-K Query Algorithms Using Density Index

Top-k query has been widely studied recently in many applied fields. Fagin et al. [3] proposed an efficient algorithm, the Threshold Algorithm (i.e. TA), to process top-k queries. However, in many cases, TA does not terminate even if the final top-k results have been found for some time. Based on these, we propose a novel algorithm: Density Threshold Algorithm (i.e. DTA), which is designed to m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Biology

سال: 2007

ISSN: 1066-5277,1557-8666

DOI: 10.1089/cmb.2007.0079